Executable Temporal Logic for Non-monotonic Reasoning
نویسندگان
چکیده
منابع مشابه
Executable Temporal Logic for Non-Monotonic Reasoning
In this paper we view nonmonotonic reasoning as a (special kind of) process. As temporal logic is a common formalism to specify and derive properties of processes, we introduce a variant of temporal logic as a general specification language for reasoning processes. We show that it is possible to execute finite specifications in this language, which leads to executability of a large class of fin...
متن کاملProlegomena to Logic Programming for Non-monotonic Reasoning Prolegomena to Logic Programming for Non{monotonic Reasoning
The present prolegomena consist, as all indeed do, in a critical discussion serving to introduce and interpret the extended works that follow in this book. As a result, the book is not a mere collection of excellent papers in their own specialty, but provides also the basics of the motivation, background history, important themes, bridges to other areas, and a common technical platform of the p...
متن کاملMeta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequent refers to the present and the future, then formulae that have their antecedent satisfied can be satisfied by considering the consequent as an imperative to be obeyed. Such a language becomes a natural alternative to ...
متن کاملLogic Programming for Non-Monotonic Reasoning
Our purpose is to exhibit a modular systematic method of representing nonmonotonic reasoning problems with the Well Founded Semantics of extended logic programs aumented with eXplicit negation (WFSX), augmented by its Contradiction Removal Semantics (CRSX) when needed. We show how to cast in the language of such logic programs forms of non-monotonic reasoning like defeasible reasoning and hypot...
متن کاملNon-Monotonic Reasoning with Logic Programming
Our purpose is to exhibit a modular systematic method of representing non{ monotonic reasoning problems with the Well Founded Semantics WFS of extended logic programs augmented with eXplicit negation (WFSX), augmented by its Contradiction Removal Semantics (CRSX) when needed. We apply this semantics, and its contradiction removal semantics counterpart, to represent non-monotonic reasoning probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1996
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0068